package com.yx.study.leet.daily;

import org.junit.Test;

/**
 * 1053. 交换一次的先前排列
 * https://leetcode.cn/problems/previous-permutation-with-one-swap/
 * */
public class PrevPermOpt1053 {
    public int[] prevPermOpt1(int[] arr) {
        int[] result = new int[arr.length];
        int max = 0;
        for (int i = 0; i <arr.length; i++) {

        }
        return result;
    }

    @Test
    public void test(){
        int[] result = new int[]{1,2,3};
        System.out.println(result.toString());
    }
}
